Visual nesting system for irregular cutting-stock problem based on rubber band packing algorithm
نویسندگان
چکیده
منابع مشابه
An ACO algorithm for one-dimensional cutting stock problem
The one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. In this paper a meta-heuristic method based on ACO is presented to solve this problem. In this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the...
متن کاملan aco algorithm for one-dimensional cutting stock problem
the one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. in this paper a meta-heuristic method based on aco is presented to solve this problem. in this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the...
متن کاملAn iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
The irregular strip packing problem is a combinatorial optimization problem that asks to place a given set of 2-dimensional polygons within a rectangular container so that no polygon overlaps with other polygons or protrudes from the container, where each polygon is not necessarily convex. The container has a fixed width, while its length can change so that all polygons are placed in it. The ob...
متن کاملExtended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem
This paper presents an extended local search algorithm (ELS) for the irregular strip packing problem. It adopts two neighborhoods, swapping two given polygons in a placement and placing one polygon into a new position. The local search algorithm is used to minimize the overlap on the basis of the neighborhoods mentioned above and the unconstrained nonlinear programming model is adopted to furth...
متن کاملA Progressive Heuristic Search Algorithm for the Cutting Stock Problem
This paper presents a new variant of the A class algorithms for solving the known one dimensional cutting stock problem in a card board factory where the objective is to minimise the useless remaining of a continuous cardboard surface The algorithm limits the number of nodes in the tree search by using a bound criterion based on the prob lem restrictions The process of computing the solution is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mechanical Engineering
سال: 2016
ISSN: 1687-8140,1687-8140
DOI: 10.1177/1687814016652080